Passing in Command Line Arguments and Parallel Cluster/Multicore Batching inRwithbatch

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

6 Command Line Arguments

bered that EUPHORIA is part of a distributed system; if the EUPHORIA module monopolizes the CPU, external modules will run slower which, in turn, will make EUPHORIA run slowly. Also, if other modules update their variables repeatedly at a rate faster than the update rate of EUPHORIA, time is still spent dealing with the intermediate values of the variables even though the values may be " skippe...

متن کامل

On-line batching problems

We introduce on-line batching problems as a new class of on-line combinatorial problems. In an on-line batching problem the task is to chop batches from a growing queue of objects, such that the cost is minimized, where the cost consists of setup cost for each batch, processing cost for each batch, and holding cost for each object that is not processed immediately. For on-line batching problems...

متن کامل

Expander graph arguments for message-passing algorithms

We show how expander based arguments may be used to prove that message passing algorithms can correct a linear number of erroneous messages. The implication of this result is that when the block length is sufficiently large, once a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually correct all errors. This result is then combined with known r...

متن کامل

Declarative Command-line Interfaces

This paper describes a new approach to generating command-line argument parsers in Perl [1]. The system presented takes a standard "usage" description and reverse-engineers a parser which satisfies that description. This ability to specify complex parsers declaratively also proves useful in other contexts, such as comma-separated-value processing, simple input parsing, and string interpolation.

متن کامل

An on-line bin-batching problem

In this note we consider a new problem, the so-called bin-batching problem related to variablesized bin covering. A best possible on-line algorithm is presented. ? 2001 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Software

سال: 2011

ISSN: 1548-7660

DOI: 10.18637/jss.v039.c01